NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
21	Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel † Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:33 Graph theory Mathematics Combinatorial optimization Edsger W. Dijkstra Matrix multiplication algorithm NP-complete problems Matching Routing algorithms Computational complexity theory Connected component Dynamic programming Graph coloring
22	C:uments and Settingsc. documentoscheTt 27, 1T.dvi Add to Reading List Source URL: personales.upv.es Language: English - Date: 2004-02-19 03:12:54 Genetic algorithms Applied mathematics Operations research Mathematics Cybernetics Computational complexity theory NP-complete problems Mathematical optimization Crossover Chromosome Mutation Vehicle routing problem
23	comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:22 Computational complexity theory Graph theory NP-complete problems Mathematics Travelling salesman problem Set TSP problem Steiner tree problem Vertex cover Approximation algorithm APX Cut Time complexity
24	Specral Graph Theory and its Applications September 2, 2004 Lecture 1 Lecturer: Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2005-06-30 12:02:42 Graph theory Mathematics Algebra Algebraic graph theory Matrices NP-complete problems Eigenvalues and eigenvectors Linear algebra Regular graph Planar graph Laplacian matrix Adjacency matrix
25	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-04-20 05:14:26 Cryptography Graph theory Mathematics NP-complete problems Zero-knowledge proof Algebraic graph theory Commitment scheme Hamiltonian path problem Hamiltonian path Proof of knowledge Adjacency matrix NP
26	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:33 Graph theory Mathematics Computational complexity theory NP-hard problems NP-complete problems Edsger W. Dijkstra Combinatorial optimization Approximation algorithms Travelling salesman problem Shortest path problem Matching Randomized algorithm
27	arXiv:1110.4319v2 [cs.DS] 20 Oct 2011 Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-10-20 20:42:54 Graph theory Computational complexity theory Mathematics NP-complete problems Graph connectivity Combinatorial optimization Cut Approximation algorithm Randomized algorithm Independent set Semidefinite programming Randomized rounding
28	Item in the Media by Ucaoimhu N A certain periodical recently used an offbeat four-word phrase to refer to an item O Add to Reading List Source URL: www.math.uchicago.edu Language: English - Date: 2006-07-22 11:54:03 NP-complete problems Leisure Logic puzzles Crossword Puzzles
29	Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:26:37 Graph theory Mathematics NP-complete problems Graph coloring Matching Bipartite graph Color-coding Treewidth Graph Cycle Line graph Chromatic polynomial
30	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-03-26 07:24:20 Graph theory Computational complexity theory Mathematics NP-complete problems Vertex cover Steiner tree problem Shortest path problem Linear programming Edge disjoint shortest pair algorithm Minimum bottleneck spanning tree